On imbalances in multipartite multidigraphs
نویسندگان
چکیده
منابع مشابه
Counting Spanning Out-trees in Multidigraphs
This paper generalizes an inclusion/exclusion counting formula of Temperley for the number of spanning trees of a graph based on its complement. The new formula is for the number of out-trees of a digraph which may have multiple arcs. This provides an extension of Temperley's formula to graphs with multiple edges. Determining which graphs have a maximum number of spanning trees is important for...
متن کاملAdditive multiplicative increasing functions on nonnegative square matrices and multidigraphs
It is known that if f is a multiplicative increasing function on N, then either f(n) = 0 for all n∈N or f(n) = n for some ¿0. It is very natural to ask if there are similar results in other algebraic systems. In this paper, we 1rst study the multiplicative increasing functions over nonnegative square matrices with respect to tensor product and then restrict our result to multidigraphs and loopl...
متن کاملMGV: A System for Visualizing Massive Multidigraphs
ÐWe describe MGV, an integrated visualization and exploration system for massive multidigraph navigation. It adheres to the Visual Information-Seeking Mantra: overview first, zoom and filter, then details on demand. MGV's only assumption is that the vertex set of the underlying digraph corresponds to the set of leaves of a predetermined tree T . MGV builds an out-of-core graph hierarchy and pro...
متن کاملRanking on Multipartite Graphs
Graphs are commonly used to model complex and large scaled structures. Friendship relations on a social platform, recommendations in big online marketplaces like e-bay or Amazon, or the link structure of the web, are examples for such structures. It is generally accepted (and appreciated) that these huge web structures tend to grow. But with a growing amount of stored data and higher complexity...
متن کاملOn multipartite posets
Let m ≥ 2 be an integer. We say that a poset P = (X, ) is m-partite if X has a partition X = X1 ∪ · · · ∪Xm such that (1) each Xi forms an antichain in P, and (2) x ≺ y implies x ∈ Xi and y ∈ Xj where i, j ∈ {1, . . . , m} and i < j. If P is m-partite for some m ≥ 2, then we say it is multipartite. – In this article we discuss the order dimension of multipartite posets in general and derive tig...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Graph Theory and Applications
سال: 2018
ISSN: 2338-2287
DOI: 10.5614/ejgta.2018.6.1.6